Universities win

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Win-win Theory for Win-win Success

THE INTELLECTUAL INVENTION THAT SURPASSES ALL OTHERS AS THE MOST BENEFICIAL ADVANCE OF HUMAN HISTORY IS RARELY UNDERSTOOD OR APPRECIATED BY EDUCATED ADULTS. With dire consequences for such neglect, there has been no applause for this wondrous invention, no gratitude for its beneficence, no monuments to hail its priceless influence. Largely overlooked, ignored, or taken for granted, this unceleb...

متن کامل

Win-Win Kernelization

We study provably effective and efficient data reduction for a class of NP-hard graph modification problems based on vertex degree properties. We show fixed-parameter tractability for NP-hard graph completion (that is, edge addition) cases while we show that there is no hope to achieve analogous results for the corresponding vertex or edge deletion versions. Our algorithms are based on transfor...

متن کامل

The Win - Win Solution

1. The following four books are all reviewed together by William Gasarch. Fair Division: From Cake Cutting to Dispute Resolution) , by Brams and Taylor, Cake Cutting: Be Fair if You Can by Robertson and Webb, The Win-Win Solution by Brams and Taylor, and Fair Allocation (Proceedings of Symposia in Applied Mathematics, Vol 33) Edited by H. Peyton Young. These books all deal with the problem of f...

متن کامل

A "win-win" for peripheral vascular intervention.

The physicians, hospitals, and particularly the sponsors of “Safety of Contemporary Percutaneous Peripheral Arterial Interventions in the Elderly: Insights from the Blue Cross Blue Shield of Michigan Cardiovascular Consortium Peripheral Vascular Intervention Registry” are to be congratulated for their innovative, forward-looking efforts to improve the quality of care for lower-extremity periphe...

متن کامل

Cop-Win Graphs and Robber-Win Graphs

Let G be a finite connected graph of order at least two. Two players (a cop and a robber) are allowed to play a game on G according to the following rule: The cop chooses a vertex to stay then the robber chooses a vertex afterwards. After that they move alternately along edges of G, where the robber may opt to stay put when his turn to move comes. The cop wins if he succeeds in putting himself ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1992

ISSN: 0028-0836,1476-4687

DOI: 10.1038/355099a0